Calculation of stability radii for combinatorial optimization problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculation of stability radii for combinatorial optimization problems

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min{sum or min{max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to the tolerance approach to sensitivity analysis.

متن کامل

On the calculation of time-varying stability radii

The problem of calculating the maximal Lyapunov exponent (generalized spectral radius) of a discrete inclusion is formulated as an average yield optimal control problem. It is shown that the maximal value of this problem can be approximated by the maximal value of discounted optimal control problems, where for irreducible inclusions the convergence is linear in the discount rate. This result is...

متن کامل

Efficient Calculation of Sensitivities for Optimization Problems

Sensitivity information is required by numerous applications such as, for example, optimization algorithms, parameter estimations or real time control. Sensitivities can be computed with working accuracy using the forward mode of automatic differentiation (AD). ADOL-C is an AD-tool for programs written in C or C++. Originally, when applying ADOL-C, tapes for values, operations and locations are...

متن کامل

Inapproximability of Combinatorial Optimization Problems

We survey results on the hardness of approximating combinatorial optimization problems.

متن کامل

An Accelerator Architecture for Combinatorial Optimization Problems

In today’s world, there are many situations in which difficult decisions must be made under such constraints as a limited resource and a limited amount of time. These situations include disaster response planning, economic policy decision-making, and investment portfolio optimization. In such situations, it is often necessary to solve a “combinatorial optimization problem,” which involves evalu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 1998

ISSN: 0167-6377

DOI: 10.1016/s0167-6377(98)00031-5